Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)
ÇѱÛÁ¦¸ñ(Korean Title) |
»ç°¢¸Á ¼ø¿ÆÐÅϸÅĪ ¹®Á¦¿¡ ´ëÇÑ º´·Ä¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
Parallel Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem |
ÀúÀÚ(Author) |
ÃÖÁöÈ¿
±è¿µÈ£
³ªÁßä
½ÉÁ¤¼·
Jihyo Choi
Youngho Kim
Joong Chae Na
Jeong Seop Sim
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 46 NO. 04 PP. 0299 ~ 0307 (2019. 04) |
Çѱ۳»¿ë (Korean Abstract) |
»ç°¢¸Á ¼ø¿ÆÐÅϸÅĪÀº ÅؽºÆ® T(|T|=n) ¿Í ÆÐÅÏ P(|P|=m)°¡ ÁÖ¾îÁ³À» ¶§, P¿Í ¼øÀ§µ¿ÇüÀÎ TÀÇ ¸ðµç »ç°¢¸Á ºÎºÐ¼¿À» ã´Â ¹®Á¦ÀÌ´Ù. º» ³í¹®¿¡¼´Â »ç°¢¸Á ¼ø¿ÆÐÅϸÅĪ¹®Á¦¸¦ ÇØ°áÇÏ´Â µÎ °¡Áö º´·Ä¾Ë°í¸®ÁòÀ» Á¦½ÃÇÑ´Ù. ¸ÕÀú O(n)°³ÀÇ ½º·¹µå¸¦ »ç¿ëÇÏ¿© O(nm)½Ã°£¿¡ ÇØ°áÇÏ´Â º´·Ä¾Ë°í¸®ÁòÀ» Á¦½ÃÇÑ ÈÄ, O(nm)°³ÀÇ ½º·¹µå¸¦ »ç¿ëÇÏ¿© O(n)½Ã°£¿¡ ÇØ°áÇÏ´Â º´·Ä¾Ë°í¸®ÁòÀ» Á¦½ÃÇÑ´Ù. ´Ù¿ìÁ¸½º Áö¼ö µ¥ÀÌÅÍ¿¡ ´ëÇÑ ½ÇÇè°á°ú, n=36,364, m=30ÀÏ ¶§, ¼øÀ§Åë°èÆ®¸®¸¦ »ç¿ëÇÑ ¼øÂ÷¾Ë°í¸®Áò¿¡ ºñÇØ Ã¹¹ø° º´·Ä¾Ë°í¸®ÁòÀº ¾à 7.2¹è ºü¸¥ ¼öÇà½Ã°£À» º¸¿´°í, µÎ ¹ø° º´·Ä¾Ë°í¸®ÁòÀº ¾à 20.6¹è ºü¸¥ ¼öÇà½Ã°£À» º¸¿´´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
Given a text T(|T|=n) and a pattern P(|P|=m), the boxed-mesh permutation pattern matching problem asks to find all boxed subsequences of T that are order-isomorphic to P. In this paper we present two parallel algorithms for the problem. We first propose an O(nm)-time parallel algorithm using O(n)threads and then propose an O(n)-time algorithm using O(nm)threads. The experimental results for Daw Jones Industrial Average show that our first and second algorithms run approximately 7.2 times and 20.6 times, respectively, faster compared to the sequential algorithm using order-statistics trees when n=36,364 and m=30.
|
Å°¿öµå(Keyword) |
¼øÀ§µ¿Çü
»ç°¢¸Á ¼ø¿ÆÐÅϸÅĪ
º´·Ä¾Ë°í¸®Áò
½º·¹µå
order-isomorphism
boxed-mesh permutation pattern matching
parallel algorithm
thread
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|